The Nagell–Ljunggren equation via Runge’s method
نویسندگان
چکیده
The Diophantine equation x n−1 x−1 = yq has four known solutions in integers x, y, q and n with |x |, |y|, q > 1 and n > 2. Whilst we expect that there are, in fact, no more solutions, such a result is well beyond current technology. In this paper, we prove that if (x, y, n, q) is a solution to this equation, then n has three or fewer prime divisors, counted with multiplicity. This improves a result of Bugeaud andMihăilescu.
منابع مشابه
On generalized Lebesgue-Ramanujan-Nagell equations
We give a brief survey on some classical and recent results concerning the generalized Lebesgue-Ramanujan-Nagell equation. Moreover, we solve completely the equation x + 1117 = y in nonnegative integer unknowns with n ≥ 3 and gcd(x, y) = 1. 1 Generalized Ramanujan-Nagell equations Mixed polynomial-exponential equations are of classical and recent interest. One of the most famous equation of thi...
متن کاملThe Generalized Nagell-Ljunggren Problem: Powers with Repetitive Representations
We consider a natural generalization of the Nagell-Ljunggren equation to the case where the qth power of an integer y, for q ≥ 2, has a base-b representation that consists of a length-l block of digits repeated n times, where n ≥ 2. Assuming the abc conjecture of Masser and Oesterlé, we completely characterize those triples (q, n, l) for which there are infinitely many solutions b. In all cases...
متن کاملThe particle swarm optimization against the Runge’s phenomenon: Application to the generalized integral quadrature method
In the present work, we introduce the particle swarm optimization called (PSO in short) to avoid the Runge’s phenomenon occurring in many numerical problems. This new approach is tested with some numerical examples including the generalized integral quadrature method in order to solve the Volterra’s integral equations. Keywords—Integral equation, particle swarm optimization, Runge’s phenomenon.
متن کاملLebesgue–nagell Equation
We discuss the feasibility of an elementary solution to the Diophantine equation of the 15 form x 2 + D = y n , where D > 1, n ≥ 3 and x > 0, called the Lebesgue–Nagell equation, which has recently been solved for 1 ≤ D ≤ 100 in [1].
متن کاملProducts of Prime Powers in Binary Recurrence Sequences Part I: The Hyperbolic Case, with an Application to the Generalized Ramanujan-Nagell Equation
We show how the Gelfond-Baker theory and diophantine approximation techniques can be applied to solve explicitly the diophantine equation C„ = wpTM< ■ ■ ■ p"< (where {G„}^_o is a binary recurrence sequence with positive discriminant), for arbitrary values of the parameters. We apply this to the equation x2 + k = p\' ■ ■ ■ pf', which is a generalization of the Ramanujan-Nagell equation x2 + 7 = ...
متن کامل